Efficient and Secure Pseudo-Random Number Generation (Extended Abstract)

Cryptographically secure pseudorandom number generators known so far suffer from the handicap of being inefficient; the most efficient ones can generate only one bit on each modular multiplication (n2 steps). Hum, Blum and Shub ask the open problem of outputting even two bits securely. We state a simple condition, the XORCondition. and show that any generator satisfying this condition can output l o g n bits on each multiplication. We also show that the l o g n least significant bits of RSA, Rabin’s Scheme, and the z2 mod N generator satisfy boolean predicates of these bits are secure. Furthermore, we strengthen the security of the z2 mod N generator, which being a Trapdoor Generator, has several applications, by proving it as hard as Factoring.